Self-Bound Finite System

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bound state spectrum in the finite volume

The signature of bound state formation on the lattice is of particular interest in this talk. In the finite volume, where all states have discrete energies, it is rather hard to distinguish between a bound state and a scattering state if the bound state were close to threshold, i.e. like a “loosely bound state”. To study bound states in the finite volume, we calculate the positronium spectrosco...

متن کامل

Finite Sample Error Bound for Parzen Windows

Parzen Windows as a nonparametric method has been applied to a variety of density estimation as well as classification problems. Similar to nearest neighbor methods, Parzen Windows does not involve learning. While it converges to true but unknown probability densities in the asymptotic limit, there is a lack of theoretical analysis on its performance with finite samples. In this paper we establ...

متن کامل

Finite dimensions and the covariant entropy bound

We explore the consequences of assuming that bounded space-time subsets contain a finite number of degrees of freedom. A physically natural hypothesis is that this number is additive for spatially separated subsets. We show that this assumption conflicts with the Lorentz symmetry of Minkowski space since it implies that a conserved current determines the number of degrees of freedom. However, t...

متن کامل

Self-Modifying Finite Automata

We present here a new model of computation: the Self-Modifying Finite Automaton (SMFA). This is similar to a standard nite automaton, but changes to the machine are allowed during a computation. It is shown here that a weak form of this model has the power to recognize an important class of context-free languages, the metalinear languages, as well as some signi cant non-context-free languages. ...

متن کامل

Self-Regulating Finite Automata

This paper introduces and discusses self-regulating finite automata. In essence, these automata regulate the use of their rules by a sequence of rules applied during previous moves. A special attention is paid to turns defined as moves during which a self-regulating finite automaton starts a new self-regulating sequence of moves. Based on the number of turns, the present paper establishes two i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Progress of Theoretical Physics

سال: 1964

ISSN: 0033-068X

DOI: 10.1143/ptp.31.787